Pseudo-median graphs are join spaces

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pseudo-median graphs are join spaces

Bandelt, H.-J. and H.M. Mulder, Pseudo-median graphs are join spaces, Discrete Mathematics 109 (1992) 13-26. Median graphs are known to share a number of geometrica! properties with Euclidean space, as is testified by the fact that median graphs ale (c!osed) join spaces-the segments of the associated join space being the geodesic intervals of the graph. As is shown in this paper the median join...

متن کامل

Join spaces , soft join spaces and lattices

The aim of this paper is to initiate and investigate new (soft) hyperstructures, particularly (soft) join spaces, using important classes of lattices: modular and distributive. They are used in order to study (soft) hyperstructures constructed on the set of all convex sublattices of a lattice.

متن کامل

On Median Graphs and Median Grid Graphs on Median Graphs and Median Grid Graphs

Let e be an edge of a median graph G which is contained in exactly one 4-cycle. Then it is proved that G n e is a median graph. The converse holds as well provided that e is not contained is a subgraph isomorphic to the 3-cube minus a vertex. These results are used to give several characterizations of median grid graphs. (Grid graphs are subgraphs of complete grids, i.e. of the Cartesian produc...

متن کامل

On median graphs and median grid graphs

Let G be a Q4-free median graph on n vertices and m edges. Let k be the number of equivalence classes of Djoković-Winkler’s relation Θ and let h be the number of Q3’s in G. Then we prove that 2n −m − k + h = 2. We also characterize median grid graphs in several different ways, for instance, they are the grid graphs with m− n + 1 squares. To obtain these results we introduce the notion of square...

متن کامل

Sparse pseudo-random graphs are Hamiltonian

In this article we study Hamilton cycles in sparse pseudorandom graphs. We prove that if the second largest absolute value of an eigenvalue of a d-regular graph G on n vertices satisfies

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1992

ISSN: 0012-365X

DOI: 10.1016/0012-365x(92)90275-k